Average Case Complexity, Revisited
نویسنده
چکیده
More than two decades elapsed since Levin set forth a theory of average-case complexity. In this survey we present the basic aspects of this theory as well as some of the main results regarding it. The current presentation deviates from our old “Notes on Levin’s Theory of Average-Case Complexity” (ECCC, TR97-058, 1997) in several aspects.
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملPartition Sort Revisited: Reconfirming the Robustness in Average Case and much more!
In our previous work there was some indication that Partition Sort could be having a more robust average case O(nlogn) complexity than the popular Quick sort. In our first study in this paper, we reconfirm this through computer experiments for inputs from Cauchy distribution for which expectation theoretically does not exist. Additionally, the algorithm is found to be sensitive to parameters of...
متن کاملMerkle Tree Traversal Revisited
We propose a new algorithm for computing authentication paths in the Merkle signature scheme. Compared to the best algorithm for this task, our algorithm reduces the worst case running time considerably.
متن کاملWorst-case analysis of generalized heapsort algorithm revisited
In this paper we present a generalized heapsort algorithm and its worst-case complexity analysis. The weighted sum of the number of comparisons and movements has been defined as a measure of the complexity. Theoretical analysis suggests that, by this criterion, 3-heap should be optimal in the worst case, contradicting the findings of A. Paulik (Paulik, A., 1990, Worst-case analysis of a general...
متن کاملPath consistency revisited
One of the main factors limiting the use of path consistency algorithms in real life applications is their high space complexity. Han and Lee 5] presented a path consistency algorithm, PC-4, with O(n 3 a 3) space complexity, which makes it practicable only for small problems. I present a new path consistency algorithm , PC-5, which has an O(n 3 a 2) space complexity while retaining the worst-ca...
متن کامل